Load { Balanced LU and QR
نویسندگان
چکیده
The concept of block{cyclic order elimination can be applied to out{of{ core LU and QR matrix factorizations on distributed memory architectures equipped with a parallel I/O system. This elimination scheme provides load balanced computation in both the factor and solve phases and further optimizes the use of the network bandwidth to perform I/O operations. Stability of LU factorization is enforced by full column pivoting. Performance results are presented for the Connection Machine system CM{5.
منابع مشابه
Block-Cyclic Dense Linear Algebra
Block{cyclic order elimination algorithms for LU and QR factorization and solve routines are described for distributed memory architectures with processing nodes conngured as two{dimensional arrays of arbitrary shape. The cyclic order elimination together with a consecutive data allocation yields good load{balance for both the factorization and solution phases for the solution of dense systems ...
متن کاملClassification using Efficient LU Decomposition in Sensornets
We consider the popular application of detection, classification and tracking and their feasibility in resource constrained sensornets. We concentrate on the classification aspect, by decomposing the complex, computationally intensive signal processing Maximum-APosterior (MAP) classifier into simpler computationally and communicationally load balanced procedures, using a clustering approach. LU...
متن کاملMultilevel communication optimal LU and QR factorizations for hierarchical platforms
This study focuses on the performance of two classical dense linear algebra algorithms, the LU and the QR factorizations, on multilevel hierarchical platforms. We first introduce a new model called Hierarchical Cluster Platform (HCP), encapsulating the characteristics of such platforms. The focus is set on reducing the communication requirements of studied algorithms at each level of the hierar...
متن کاملMixing LU and QR factorization algorithms to design high-performance dense linear algebra solvers
This paper introduces hybrid LU–QR algorithms for solving dense linear systems of the form Ax = b. Throughout a matrix factorization, these algorithms dynamically alternate LU with local pivoting and QR elimination steps based upon some robustness criterion. LU elimination steps can be very efficiently parallelized, and are twice as cheap in terms of floating-point operations, as QR steps. Howe...
متن کاملCommunication-optimal Parallel and Sequential QR and LU Factorizations
We present parallel and sequential dense QR factorization algorithms that are both optimal (up to polylogarithmic factors) in the amount of communication they perform and just as stable as Householder QR. We prove optimality by deriving new lower bounds for the number of multiplications done by “non-Strassen-like” QR, and using these in known communication lower bounds that are proportional to ...
متن کامل